Towards In-Network Compact Representation: Mergeable Counting Bloom Filter Vis Cuckoo Scheduling

With the breakthrough of edge intelligence, we are witnessing a booming increase in distributed applications on nodes. These need to apply novel data representation algorithm support data-information exchanging and based decision among different As most efficient compact algorithm, Counting Bloom Filter (CBF) is an extension filter, which enables updating as well inserting into representation. To facilitate nodes, nodes exchange summarize information collected from Impossible merge with other CBFs, existing CBF its variants thus cannot be used for representing handle this problem, design mergeable CBF, mergeCBF. Based insight about counting processing unfold counter array conventional group bit arrays, order merging multiple filters, map each inputted item cells cuckoo-scheduled arrays instead counters CBF. Experiments real-world datasets demonstrate that mergeCBF can operations way without degrading quality results.